Class Specialization
Word Graph
A special automaton that stores words instead of single characters along its edges.
Parameters
The alphabet type that is used for the words. Metafunctions: Alphabet Default: Remarks: Use Alphabet to get the value type of the words. | |
The specializing type. Metafunctions: Spec |
Specialization of
Metafunctions
Type of additional data stored in an object. (Graph) | |
Type of an object that represents an edge descriptor. (Graph) | |
Type of an object that represents an Id Manager. (Graph) | |
Edge type of a graph object. (Graph) | |
Type of the object a given object depends on. (Graph) | |
Type of iterator objects that are used to traverse the container. (Graph) | |
Type of an object that is suitable to hold size information. (Graph) | |
The spec of a class. (Graph) | |
Type of an object that represents a vertex descriptor. (Graph) |
Functions
Adds a new edge to the graph, either with or without cargo. (Graph) | |
Shortcut to add multiple edges at once. Creates vertices implicitly. (Graph) | |
Adds a new vertex to the graph. (Graph) | |
Finds shortest paths between all pairs of vertices in a graph. (Graph) | |
Assigns a new root vertex to the automaton. (Automaton) | |
Computes shortest paths from a single source in a graph. (Graph) | |
Implements a breadth-first search on a graph. (Graph) | |
Resets an object. (Graph) | |
Removes all edges in a graph. (Graph) | |
Removes all vertices in a graph. (Graph) | |
Creates the root in a tree or an automaton. (Automaton) | |
Number of incident edges for a given vertex. (Graph) | |
Implements a depth-first search on a graph. (Graph) | |
Computes shortest paths from a single source in a graph. (Graph) | |
Test a container for being empty. (Graph) | |
Finds an edge. (Graph) | |
Finds shortest paths between all pairs of vertices in a graph. (Graph) | |
Returns an adjacency matrix representation of the graph. (Graph) | |
Utility function for various graph algorithms. (Graph) | |
Get method for the root of a tree or an automaton. (Automaton) | |
Gets the successor for a given vertex and an edge label. For an automaton a single character is required whereas for a word graph getSuccessor takes a string. | |
Number of incoming edges for a given vertex. (Graph) | |
Tests whether a given vertex is the root or not. (Automaton) | |
Computes a minimum spanning tree on a graph. (Graph) | |
Number of edges in a graph. (Graph) | |
Number of vertices in a graph. (Graph) | |
Number of outgoing edges for a given vertex. (Graph) | |
Parses a string one character at a time and moves accordingly in the automaton. | |
Computes a minimum spanning tree on a graph. (Graph) | |
Removes an edge from the graph. For automatons a label is required. (Graph) | |
Removes the incoming edges of a given vertex. (Graph) | |
Removes the outgoing edges of a given vertex. (Graph) | |
Removes a vertex. (Graph) | |
Initializes an edge map (Graph) | |
Initializes a vertex map. (Graph) | |
Gets a reference to the root of the tree. (Automaton) | |
Returns the source vertex of an edge. (Graph) | |
Returns the target vertex of an edge. (Graph) | |
Determines whether there is a path between any two given vertices or not. (Graph) | |
Transposes a graph, either in-place or from source to dest. (Graph) |
Example Programs
All Pairs Shortest Path, Bellman-Ford Algorithm, Breadth-First Search, Depth-First Search, Dijkstras Algorithm, Floyd-Warshall Algorithm, Gotohs Algorithm, Heaviest Increasing Subsequence, Heuristic Matching, Hirschbergs Algorithm, Kruskals Algorithm, Longest Common Subsequence, Longest Increasing Subsequence, Maximum Flow, MSA with Neighbor-Joining, MSA with UPGMA, Needleman-Wunsch Algorithm, Prims Algorithm, Shortest Path in DAGs, Smith-Waterman Algorithm, Strongly Connected Components, T-Coffee, Topological Sort, Transitive Closure
Include Headers
graph.h
SeqAn - Sequence Analysis Library - www.seqan.de